package subject.erfen;

public class searchInsert {
    public int searchInsert1(int[] nums, int target) {
        int length = nums.length;
        int left  = 0;
        int right = length - 1;
        while(left <= right){
            int mid = left + (right - left) / 2;
            if(target > nums[mid]){
                left = mid + 1;
            }else{
                right = mid - 1;
            }
        }
        return left;
    }
}
